Time optimized multi-agent path planning using guided iterative prioritized planning
نویسندگان
چکیده
This paper proposes the guided iterative prioritized planning (GIPP) algorithm to address the problem of moving multiple mobile agents to their respective destinations in a shortest timerelated cost. Compared to other MAPP algorithms, the GIPP algorithm strikes a good balance between various performance criteria such as finding feasible solutions, completing the task promptly and low computational cost.
منابع مشابه
A Meta-Heuristic Approach For Energy-Efficient Multi-Agent Path Planning
We address the problem of multi-agent path planning (MAPP) by taking into account the total energy consumption of all agents, as measured by their cumulative distance travelled. A deterministic meta-heuristic technique called guided iterative prioritized planning (GIPP) is proposed to find good solutions with respect to this cumulative cost measure in a crowded environment. GIPP progressively e...
متن کاملAsynchronous Decentralized Algorithm for Space-Time Cooperative Pathfinding
Cooperative pathfinding is a multi-agent path planning problem where a group of vehicles searches for a corresponding set of non-conflicting space-time trajectories. Many of the practical methods for centralized solving of cooperative pathfinding problems are based on the prioritized planning strategy. However, in some domains (e.g., multi-robot teams of unmanned aerial vehicles, autonomous und...
متن کاملLearnable Evolutionary Optimization in Autonomous Pickup & Delivery Planning
This report describes an evolutionary approach to distributed planning by transport agents. These agents, representing trucks, autonomously decide on their transport orders by interacting with cargo agents representing containers. The agents use a guided evolutionary computation method, called the learnable evolution model, to create transport plans and render optimized decisions on which cargo...
متن کاملEvolutionary path planning for autonomous air vehicles using multi-resolution path representation
There is a recognized need for automated path planning for unmanned air vehicles (UAVs) and guided munitions. Evolutionary programming approaches provide an alternative to classical functional optimization methods with the capability of incorporating a variety of optimization goals, while tolerating vehicle constraints. In this work, we introduce an evolutionary flight path planning algorithm c...
متن کاملFinding coordinated paths for multiple holonomic agents in 2-d polygonal environment
Avoiding collisions is one of the vital tasks for systems of autonomous mobile agents. We focus on the problem of finding continuous coordinated paths for multiple mobile disc agents in a 2-d environment with polygonal obstacles. The problem is PSPACE-hard, with the state space growing exponentially in the number of agents. Therefore, the state of the art methods include mainly reactive techniq...
متن کامل